Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
871	On the number of specic spanning subgraphs of the graphs G Pn F.J. Faase [removed] January 15, 1994 Add to Reading List Source URL: www.iwriteiam.nl Language: English - Date: 2009-03-29 11:16:04 Graph Adjacency matrix Connectivity Vertex Path graph Degree Spanning tree Graph operations Graph labeling Graph theory Mathematics Tree
872	Type Checking C++ Template Instantiation by Graph Programs Add to Reading List Source URL: formale-sprachen.informatik.uni-oldenburg.de Language: English - Date: 2008-06-05 12:23:02 Graph Tree Matching Path decomposition Graph coloring Graph theory Mathematics Theoretical computer science
873	PDF Document Add to Reading List Source URL: www.medicine-science.net23.net Language: English - Date: 2013-02-01 02:02:16 Eulerian path Minor Connectivity Graph De Bruijn graph Matroid theory Koorde De Bruijn sequence Graph theory Bioinformatics Sequence assembly
874	Calculating Graph Algorithms for Dominance and Shortest Path⋆ Ilya Sergey1 , Jan Midtgaard2 , and Dave Clarke1 1 KU Leuven, Belgium Add to Reading List Source URL: ilyasergey.net Language: English - Date: 2014-05-28 18:27:05 Group actions Group theory Abstract interpretation Galois connection Order theory Structure Orbifold Holomorphic functional calculus Abstract algebra Mathematics Algebra
875	Graham’s Problem (and Number) Michael Albanese Consider an n-dimensional hypercube (for n = 2 it’s a square, n = 3 a cube, and so on). Choose two vertices (i.e. corners) and draw a straight line between them. Now col Add to Reading List Source URL: www.maths.adelaide.edu.au Language: English - Date: 2012-10-08 01:29:12 Cubes Hypercube Graph Hypercube graph Induced path Graph theory Geometry Mathematics
876	Computing Replacement Paths in Surface Embedded Graphs∗ Jeff Erickson Amir Nayyeri Department of Computer Science Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 02:11:19 Network theory Combinatorial optimization Shortest path problem Routing algorithms Matching Maximum flow problem Eulerian path Dynamic programming Graph Graph theory Mathematics Theoretical computer science
877	Minimum Cuts and Shortest Non-Separating Cycles via Homology Covers∗ Jeff Erickson Amir Nayyeri Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 02:17:45 Induced path Shortest path problem Minimum spanning tree Maximum flow problem Cycle Degree Graph embedding Skew-symmetric graph Cycle rank Graph theory Mathematics Spanning tree
878	Minimum Cuts and Shortest Homologous Cycles∗ Erin W. Chambers Jeff Erickson Department of Computer Science and Mathematics Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2009-08-14 15:23:44 Planar graphs Spanning tree Graph coloring Minor Minimum spanning tree Graph embedding Shortest path problem Forbidden graph characterization Matching Graph theory Mathematics Topological graph theory
879	Homology Flows, Cohomology Cuts∗ Erin W. Chambers† Jeff Erickson‡ Amir Nayyeri§ Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 00:53:08 Planar graph Maximum flow problem Shortest path problem Minor Graph coloring Neighbourhood Homeomorphism Tree decomposition Connectivity Graph theory Mathematics Graph operations
880	Shortest Non-Crossing Walks in the Plane∗ Jeff Erickson Amir Nayyeri Department of Computer Science Add to Reading List Source URL: compgeom.cs.uiuc.edu Language: English - Date: 2012-01-21 02:15:47 Network theory Tree Graph embedding Planar graph Shortest path problem Induced path Routing algorithms Biased graph Planar separator theorem Graph theory Mathematics Topological graph theory